Computational Representation of Practical Argument
نویسندگان
چکیده
In this paper we consider persuasion in the context of practical reasoning, and discuss the problems associated with construing reasoning about actions in a manner similar to reasoning about beliefs. We propose a perspective on practical reasoning as presumptive justification of a course of action, along with critical questions of this justification, building on the account of Walton. From this perspective, we articulate an interaction protocol, which we call PARMA, for dialogues over proposed actions based on this theory. We outline an axiomatic semantics for the PARMA Protocol, and discuss two implementations which use this protocol to mediate a discussion between humans. We then show how our proposal can be made computational within the framework of agents based on the Belief-Desire-Intention model, and illustrate this proposal with an example debate within a multi agent system.
منابع مشابه
Computational Modeling of 2-sided Message’s Effects on Perceived Argument Strength
The aim of this research is studying of 2-sided message’s effects on persuasiveness of anti-drug messages by computational modeling method. It’s been done for getting more effective and more persuasive messages. Persuasiveness of messages is measured be perceived argument strength of them which is determined by audiences. In this research, according to formative researches, a method for measuri...
متن کاملArgumentation Schemes: From Informal Logic to Computational Models
Walton’s argumentation schemes with associated characteristic critical questions have been the inspiration for a number of approaches to computational modelling of argumentation. Walton’s schemes were originally intended for use in the analysis of natural language argument: once the scheme had been identified the critical questions were able to identify ways in which the presumptive conclusion ...
متن کاملOn Demonstrating the Impact of Defeasible Reasoning in Practice via a Multi-layer Argument-based Framework
Argumentation theory (AT) is an important area of logicbased artificial intelligence, which provides the basis for computational models of defeasible reasoning. Promising results have indicated AT as a solid research area for implementing defeasible reasoning in practice. However, applications are usually ad-hoc frameworks, not incorporating all the layers and steps required in an argumentation...
متن کاملCOMPUTATIONAL ENUMERATION OF POINT DEFECT CLUSTERS IN DOUBLE- LATTICE CRYSTALS
The cluster representation matrices have already been successfully used to enumerate close-packed vacancy clusters in all single-lattice crystals [I, 2]. Point defect clusters in double-lattice crystals may have identical geometry but are distinct due to unique atomic postions enclosing them. The method of representation matrices is extended to make it applicable to represent and enumerate ...
متن کاملSupporting Argument in E-democracy
Methods of argument representation can be exploited in systems for edemocracy. In this paper we discuss a particular method of argument representation, known as an argumentation scheme, and some issues concerning the relations between arguments represented using such schemes. We show how this method of argument representation has been implemented in a practical system designed for the public to...
متن کاملComputational Representation of Persuasive Argument
In this report we discuss the typology of dialogues given by Walton and Krabbe and offer a precise interpretation of them. We go on to discuss one of these dialogue types persuasion in the context of practical reasoning and the problems associated with such reasoning. We propose a perspective on practical reasoning as presumptive justification and critical questions, giving an extension to the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Synthese
دوره 152 شماره
صفحات -
تاریخ انتشار 2006